A combinatorial constraint satisfaction problem dichotomy classification conjecture
نویسندگان
چکیده
منابع مشابه
A combinatorial constraint satisfaction problem dichotomy classification conjecture
We further generalise a construction – the fibre construction – that was developed in an earlier paper of the first two authors. The extension in this paper gives a polynomial-time reduction of CSP(H) for any relational system H to CSP(P ) for any relational system P that meets a certain technical partition condition, that of being K3-partitionable. Moreover, we define an equivalent condition o...
متن کاملA New Combinatorial Approach to the Constraint Satisfaction Problem Dichotomy Classification
We introduce a new general polynomial-time constructionthe fibre constructionwhich reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction problem CSP(P ), where P is any subprojective relational structure. As a consequence we get a new proof (not using universal algebra) that CSP(P ) is NP -complete for any subprojective (and so for any projective) relational structur...
متن کاملTowards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem
The Counting Constraint Satisfaction Problem (#CSP) can be expressed as follows: given a set of variables, a set of values that can be taken by the variables, and a set of constraints specifying some restrictions on the values that can be taken simultaneously by some variables, determine the number of assignments of values to variables that satisfy all the constraints. The #CSP provides a gener...
متن کاملAn Effective Dichotomy for the Counting Constraint Satisfaction Problem
Bulatov (2008) gave a dichotomy for the counting constraint satisfaction problem #CSP. A problem from #CSP is characterised by a constraint language Γ, a fixed, finite set of relations over a finite domain D. An instance of the problem uses these relations to constrain an arbitrarily large finite set of variables. Bulatov showed that the problem of counting the satisfying assignments of instanc...
متن کاملA Complexity Dichotomy for Poset Constraint Satisfaction
We determine the complexity of all constraint satisfaction problems over partial orders, in particular we show that every such problem is NP-complete or can be solved in polynomial time. This result generalises the complexity dichotomy for temporal constraint satisfaction problems by Bodirsky and Kára. We apply the so called universal-algebraic approach together with tools from model theory and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2010
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2009.02.007